Quermass-interaction processes: conditions for stability
نویسندگان
چکیده
منابع مشابه
Quermass-interaction Processes: Conditions for Stability
We consider a class of random point and germ-grain processes, obtained using a rather natural weighting procedure. Given a Poisson point process, on each point one places a grain, a (possibly random) compact convex set. Let be the union of all grains. One can now construct new processes whose density is derived from an exponential of a linear combination of quermass functionals of. If only the ...
متن کاملContinuum percolation for quermass interaction model
Continuum percolation for Markov (or Gibbs) germ-grain models in dimension 2 is investigated. The grains are assumed circular with random radii on a compact support. The morphological interaction is the so-called Quermass interaction defined by a linear combination of the classical Minkowski functionals (area, perimeter and Euler-Poincaré characteristic). We show that percolation occurs for any...
متن کاملExistence of Quermass-Interaction Process for non locally stable interaction and non bounded convex grains
We prove the existence of infinite volume Quermass-Interaction Process in a general setting of non locally stable interaction and non bounded convex grains. No condition on the parameters of the linear combination of the Minkowski functionals is assumed. The only condition is that the square of the random radius of the grain admits exponential moments for all orders. Our methods are based on en...
متن کاملMathematical Conditions for Brain Stability
We investigate the stability of a dynamic brain model using conventional techniques of linearization of the state space equations of motion for two nearby solutions followed by solution via expansion in the eigenvectors of the Jacobian matrix with eigenvalues λ1, λ2, ..., λn. The fundamental stability condition for brains is then |λk| ≅ 1. By equating terms in two versions of the characteristic...
متن کاملStability Conditions for Online Learnability
Stability is a general notion that quantifies the sensitivity of a learning algorithm’s output to small change in the training dataset (e.g. deletion or replacement of a single training sample). Such conditions have recently been shown to be more powerful to characterize learnability in the general learning setting under i.i.d. samples where uniform convergence is not necessary for learnability...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Probability
سال: 1999
ISSN: 0001-8678,1475-6064
DOI: 10.1239/aap/1029955137